Fast garbage compaction with interior pointers

This paper presents a garbage compaction algorithm, which extends the well-known algorithm of Jonkers with the ability to handle interior pointers. It is as efficient as Jonkers’ algorithm in the absence of interior pointers, and in practice only slightly less efficient in the presence of interior pointers, while at the same time, it does not impose any additional space overhead. This, however, is partly due to the fact that only certain kinds of interior pointers are allowed.